By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 34, Issue 4, pp. 775-1024

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Complexity of the Union of $(\alpha,\beta)$-Covered Objects

Alon Efrat

pp. 775-787

BibTeX  Abstract Full Text:  PDF

Stochastic Machine Scheduling with Precedence Constraints

Martin Skutella and Marc Uetz

pp. 788-802

BibTeX  Abstract Full Text:  PDF

Improved Combinatorial Algorithms for Facility Location Problems

Moses Charikar and Sudipto Guha

pp. 803-824

BibTeX  Abstract Full Text:  PDF

On the Relationship Between Clique-Width and Treewidth

Derek G. Corneil and Udi Rotics

pp. 825-847

BibTeX  Abstract Full Text:  PDF

Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups

Chryssis Georgiou, Alexander Russell, and Alexander A. Shvartsman

pp. 848-862

BibTeX  Abstract Full Text:  PDF

Curve-Sensitive Cuttings

Vladlen Koltun and Micha Sharir

pp. 863-878

BibTeX  Abstract Full Text:  PDF

Low-Dimensional Linear Programming with Violations

Timothy M. Chan

pp. 879-893

BibTeX  Abstract Full Text:  PDF

Dynamic LCA Queries on Trees

Richard Cole and Ramesh Hariharan

pp. 894-923

BibTeX  Abstract Full Text:  PDF

Orderly Spanning Trees with Applications

Yi-Ting Chiang, Ching-Chi Lin, and Hsueh-I Lu

pp. 924-945

BibTeX  Abstract Full Text:  PDF

$\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation

Anna Gál and Adi Rosén

pp. 946-959

BibTeX  Abstract Full Text:  PDF

A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields

Michael Kaminski

pp. 960-992

BibTeX  Abstract Full Text:  PDF

A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors

Grzegorz Malewicz

pp. 993-1024

BibTeX  Abstract Full Text:  PDF